Freeform surface adaptive interferometry assisted with simulated annealing-hill climbing algorithm
نویسندگان
چکیده
The freeform surface adaptive interferometer (FSAI) recently has been employed to realize the unknown metrology. A near null interferogram should be acquired from initial with undistinguished fringes even dark areas. direct optimization object in FSAI is just rather than focusing intensity characterization traditional wavefront-sensorless (WFS) systems. simulated annealing-hill climbing (SA-HC) mixed algorithm FSAI, which much better convergence stochastic parallel gradient descent (SPGD) algorithm, almost as genetic (GA). At same time, it faster GA and thus applicable test of volume-produced optical shop. Simulations experiments validating feasibility are presented.
منابع مشابه
A simulated annealing and hill-climbing algorithm for the traveling tournament problem
The Traveling Tournament Problem (TTP) [E. Easton, G. Nemhauser, M. Trick, The traveling tournament problem description and benchmarks, in: Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, CP 2001, 2001, pp. 580–584; M. Trick, Challenge Traveling Tournament Problems, 2004] schedules a double round-robin tournament to minimize the total distan...
متن کاملProgram Search with a Hierarchical Variable Lenght Representation: Genetic Programming, Simulated Annealing and Hill Climbing
This paper presents a comparison of Genetic Programming(GP) with Simulated Annealing (SA) and Stochastic Iterated Rill Climbing (SIRC) based on a suite of program discovery problems which have been previously tackled only with GP. All three search algorithms employ the hierarchical variable length representation for programs brought into recent prominence with the GP paradigm [K-92]. We experim...
متن کاملImproved Hill Climbing and Simulated Annealing Algorithms for Size Optimization of Trusses
Truss optimization problem has been vastly studied during the past 30 years and many different methods have been proposed for this problem. Even though most of these methods assume that the design variables are continuously valued, in reality, the design variables of optimization problems such as cross-sectional areas are discretely valued. In this paper, an improved hill climbing and an improv...
متن کاملportfolio optimization with simulated annealing algorithm
the markowitz issue of optimization can’t be solved by precise mathematical methods such as second order schematization, when real world condition and limitations are considered. on the other hand, most managers prefer to manage a small portfolio of available assets in place of a huge portfolio. it can be analogized to cardinal constrains, that is, constrains related to minimum and maximum curr...
متن کاملAlgorithm Mapping with Parallel Simulated Annealing Algorithm Mapping with Parallel Simulated Annealing ?
This paper presents a parallel simulated annealing algorithm for solving the problem of mapping irregular parallel programs onto homogeneous processor arrays with regular topology. The algorithm constructs and uses joint transformations. These transformations guarantee a high degree of parallelism that is bounded below by d jNpj deg(Gp)+1 e, where jN p j is the number of task nodes in the mappe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Measurement
سال: 2021
ISSN: ['1873-412X', '0263-2241']
DOI: https://doi.org/10.1016/j.measurement.2021.109597